Signum: Estudos da Linguagem, Londrina, v.11, n.1, jul. 2008

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transcriptome studies in the context of disturbed connectivity in schizophrenia Estudos transcriptômicos no contexto da conectividade perturbada em esquizofrenia

Schizophrenia is a severe neurobiological disease with genetic and environmental factors playing a role in the pathophysiology. Several brain regions have been implicated in the disease process and are connected in complex neuronal circuits. On the cellular and molecular level, affected connectivity between these regions, involving dysfunctional myelination of neuronal axons, as well as alterat...

متن کامل

SIGNUM: A Graph Algorithm for Terminology Extraction

Terminology extraction is an essential step in several fields of natural language processing such as dictionary and ontology extraction. In this paper, we present a novel graph-based approach to terminology extraction. We use SIGNUM, a general purpose graph-based algorithm for binary clustering on directed weighted graphs generated using a metric for multi-word extraction. Our approach is total...

متن کامل

Utilizando sistemas de conhecimento para a identificação da presença de metas flexíveis em uma linguagem de domínio

Resumo: A utilização de sistemas de conhecimento em problemas que não são totalmente conhecidos ou bem definidos permite entender esses problemas de maneira exploratória, simulando situações e soluções utilizando técnicas de inteligência artificial. A abordagem inicial utilizada nos projetos de pesquisa do grupo tinha como foco apenas verificar a presença de atributos de transparência em modelo...

متن کامل

The Signum Equation for Erdős-surányi Sequences

For an Erdős-Surányi sequence it is customary to consider its signum equation. Based on some classical heuristic arguments, we conjecture the asymptotic behavior for the number of solutions of this signum equation in the case of the sequence {n}n (k 2) and the sequence of primes. Surprisingly, we show that this method does not apply at all for the Fibonacci sequence. By computing the precise nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signum: Estudos da Linguagem

سال: 2008

ISSN: 2237-4876,1516-3083

DOI: 10.5433/2237-4876.2008v11n1p